Knowledge Graph Embedding for Link Prediction
نویسندگان
چکیده
Knowledge Graphs (KGs) have found many applications in industrial and academic settings, which turn, motivated considerable research efforts towards large-scale information extraction from a variety of sources. Despite such efforts, it is well known that even the largest KGs suffer incompleteness; Link Prediction (LP) techniques address this issue by identifying missing facts among entities already KG. Among recent LP techniques, those based on KG embeddings achieved very promising performance some benchmarks. fast-growing literature subject, insufficient attention has been paid to effect design choices methods. Moreover, standard practice area report accuracy aggregating over large number test are vastly more represented than others; allows methods exhibit good results just attending structural properties include entities, while ignoring remaining majority This analysis provides comprehensive comparison embedding-based methods, extending dimensions beyond what commonly available literature. We experimentally compare effectiveness efficiency 18 state-of-the-art consider rule-based baseline, detailed most popular benchmarks
منابع مشابه
From One Point to a Manifold: Knowledge Graph Embedding for Precise Link Prediction
Knowledge graph embedding aims at offering a numerical knowledge representation paradigm by transforming the entities and relations into continuous vector space. However, existing methods could not characterize the knowledge graph in a fine degree to make a precise link prediction. There are two reasons for this issue: being an ill-posed algebraic system and adopting an overstrict geometric for...
متن کاملSimplE Embedding for Link Prediction in Knowledge Graphs
The aim of knowledge graphs is to gather knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs are far from complete. To address the incompleteness of the knowledge graphs, link prediction approaches have been developed which make probabilistic predictions about new links in a knowledge graph given the existing links. Tensor factorization ...
متن کاملLink Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملSemi-supervised Graph Embedding Approach to Dynamic Link Prediction
We propose a simple discrete time semi–supervised graph embedding approach to link prediction in dynamic networks. The learned embedding reflects information from both the temporal and cross–sectional network structures, which is performed by defining the loss function as a weighted sum of the supervised loss from past dynamics and the unsupervised loss of predicting the neighborhood context in...
متن کاملSemantically Smooth Knowledge Graph Embedding
This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Knowledge Discovery From Data
سال: 2021
ISSN: ['1556-472X', '1556-4681']
DOI: https://doi.org/10.1145/3424672